package jianzhioffer;

// 剑指 Offer 25. 合并两个排序的链表
public class MergeTwoLists {

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode h = new ListNode(-1);
        ListNode p = h;
        while (l1 != null && l2 != null) {
            if (l1.val <= l2.val) {
                p.next = l1;

                l1 = l1.next;
            } else {
                p.next = l2;

                l2 = l2.next;
            }
            p = p.next;
        }
        p.next = l1==null?l2:l1;
        return h.next;
    }
}
